Some results on caps and codes related to orthogonal Grassmannians - a preview

نویسندگان

  • Ilaria Cardinali
  • Luca Giuzzi
چکیده

In this note we offer a short summary of some recent results, to be contained in a forthcoming paper [4], on projective caps and linear error correcting codes arising from the Grassmann embedding ε k of an orthogonal Grassmannian ∆k. More precisely, we consider the codes arising from the projective system determined by ε k (∆k) and determine some of their parameters. We also investigate special sets of points of ∆k which are met by any line of ∆k in at most 2 points proving that their image under the Grassmann embedding is a projective cap.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Codes and caps from orthogonal Grassmannians

In this paper we investigate linear error correcting codes and projective caps related to the Grassmann embedding ε k of an orthogonal Grassmannian ∆k. In particular, we determine some of the parameters of the codes arising from the projective system determined by ε k (∆k). We also study special sets of points of ∆k which are met by any line of ∆k in at most 2 points and we show that their imag...

متن کامل

Polar Grassmannians and their Codes

We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.

متن کامل

Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver

Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...

متن کامل

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

Enumerative coding for line polar Grassmannians with applications to codes

A k-polar Grassmannian is the geometry having as pointset the set of all k-dimensional subspaces of a vector space V which are totally isotropic for a given non-degenerate bilinear form μ defined on V. Hence it can be regarded as a subgeometry of the ordinary k-Grassmannian. In this paper we deal with orthogonal line Grassmannians and with symplectic line Grassmannians, i.e. we assume k = 2 and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2013